Learning Monotone DNF Using SPP Teaching Assistant
نویسنده
چکیده
منابع مشابه
Learning DNFs and Circuits Using Teaching Assistants
In this paper we consider the complexity of learning monotone DNF formulae and Boolean circuits in an exact learning model called the teaching assistant model. This model, introduced in one of our earlier works, uses teaching assistant classes for classifying learning problems. Teaching assistant classes are a learning-theoretic analog of complexity classes. We show that monotone DNFs are learn...
متن کاملLearning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows efficient learning of MDNF using Equivalence Queries and Incomplete Membership Queries with probability of p = 1 − 1/poly(n, t) of failing. Our algorithm is expected to make
متن کاملLearning Random Monotone DNF Under the Uniform Distribution
We show that randomly generated monotonec log(n)-DNF formula can be learned exactly inprobabilistic polynomial time. Our notion of ran-domly generated is with respect to a uniform dis-tribution. To prove this we identify the class ofwell behaved monotone c log(n)-DNF formulae,and show that almost every monotone DNF for-mula is well-behaved, and that there exists a pr...
متن کاملLearning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length ≈ log t(n) under the uniform distribution on the Boolean cube {0, 1}n. For any function t(n) ≤ poly(n) the algorithm runs in time poly(n, 1/ǫ) and with high probability outputs an ǫ-accurate monotone DNF hypothesis. This is the first algorithm that can learn monotone DNF of arbitrary po...
متن کاملOn Learning Monotone DNF under Product Distributions
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an exponential improvement over the best previous polynomial-time algorithms in this model, which could learn monotone o(log n)-term DNF. We also show that various classes of small constant-depth circuits which compute monotone...
متن کامل